Scheduling with forbidden sets

On-line scheduling with forbidden zones

In various manufacturing and computing contexts there may be a certain period in each time interval, during which processing may continue but may not be initiated. We examine the problem of on-line scheduling in the presence of such forbidden zones, whose complements are starting time windows. We show that no on-line algorithm is better than 9 7 competitive, when minimizing the number of interv...

Single machine scheduling with forbidden start times

This paper addresses a single machine scheduling problem in which the following simple constraint is added: a set of time slots is forbidden for starting a task, that is no task can start at any forbidden time point. We show that the single machine problem with makespan minimization is strongly NP-complete and we give polynomial algorithms to solve the problems with a small number of forbidden ...

Erdős-Szekeres Theorem for Point Sets with Forbidden Subconfigurations

According to the Erdős-Szekeres theorem, every set of n points in the plane contains roughly logn in convex position. We investigate how this bound changes if our point set does not contain a subset that belongs to a fixed order type.

Semi-regular relative difference sets with large forbidden subgroups

Article history: Received 19 October 2007 Available online 16 April 2008 Communicated by Charles J. Colbourn

Choosability of graphs with infinite sets of forbidden differences